VeriFLog: A Constraint Logic Programming Approach to Verification of Website Content
نویسندگان
چکیده
Web site semantic content veri cation can be a tedious and error prone task. In this paper we propose a framework for syntactic validation and semantic veri cation based on the logic programming language XCentric. The high declarative model of this language based on a new uni cation algorithm along with an interface to semistructured data provides an elegant framework for semantic error detection. The result is an easy to follow model to improve website quality and management.
منابع مشابه
Representing Constraints with Automata
In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the assignments which make the formulas true. We show that this allows an efficient representation of knowledge about the content of constraints which can be use...
متن کاملClustered Absolute Path Index for XML Document: On Efficient Processing of Twig Queries
Positioning-based query translation between SQL and XQL with location counter p. 11 Integrating XML schema language with databases for B2B collaborations p. 19 Functional dependencies in XML documents p. 29 Querying composite events for reactivity on the Web p. 38 Efficient evaluation of XML twig queries p. 48 Early evaluating XML trees in object repositories p. 58 Coaching frequent XML query p...
متن کاملA Symbolic Execution Framework with Explicit Heaps and Separation
Program verification of heap properties is challenging. A promising approach is Separation Logic, which supports local reasoning over disjoint portions of the heap. In this paper, we propose a heap constraint language H that explicates the heap and incorporates separation. By explicating the heap, the language is more suitable for automatic symbolic execution. We show that this language can be ...
متن کاملNon-determinism and Probabilities in Timed Concurrent Constraint Programming (Extended Version)
We set the grounds of a framework for modeling and verifying systems involving probabilities, time, and partial information as constraints. A timed concurrent constraint process calculus with probabilistic and non-deterministic choices is proposed as description language. An operational semantics ensures consistent interactions between both kinds of choices. The semantics is also shown to be in...
متن کاملA statistical model checker for situation calculus based multi-agent models
In this paper we introduce a new approach for multi-agent simulation and statistical model checking that combines the well-established situation calculus with a first order version of bounded linear time logic (BLTL). This creates a fully integrated solution for specifying system behavior and requirements within the same logical framework. We realized the approach in an extensible tool that com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006